Algorithms Meet Art, Puzzles, and Magic
نویسنده
چکیده
Two years before WADS began, my father Martin Demaine and my six-year-old self designed and made puzzles as the Erik and Dad Puzzle Company, which distributed to toy stores across Canada. So began our journey into the interactions between algorithms and the arts. More and more, we find that our mathematical research and artistic projects converge, with the artistic side inspiring the mathematical side and vice versa. Mathematics itself is an art form, and through other media such as sculpture, puzzles, and magic, the beauty of mathematics can be brought to a wider audience. These artistic endeavors also provide us with deeper insights into the underlying mathematics, by providing physical realizations of objects under consideration, by pointing to interesting special cases and directions to explore, and by suggesting new problems to solve (such as the metapuzzle of how to solve a puzzle). This talk will give several examples in each category, from how our first font design led to a universality result in hinged dissections, to how studying curved creases in origami led to sculptures at MoMA. The audience will be expected to participate in some live magic demonstrations.
منابع مشابه
Verifying LEGO: Validation and Synthesis of Embedded Software, a practical talk describing the success of the fifteen-year UPPAAL project in verification, with applications ranging from walking robots through installation of wind turbines to ventilation in Danish pig
s for the talks are provided below; further details are available via the BCTCS 2010 website at http://www.bctcs.ac.uk/BCTCS2010/. The financial support of the Engineering and Physical Sciences Research Council (EPSRC), the London Mathematical Society (LMS) and the Scottish Informatics and Computer Science Alliance (SICSA) is gratefully acknowledged. The organizers also thank the local staff an...
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملImage Generation from Magic Squares
The paper is departing from a position in aesthetic theory, in which order of some sort is considered a contributing factor to aesthetic value. It is likewise departing from a position, that generative art, drawing on rule based systems and algorithms, is a legitimate art practice. Instead of generating order by falling back on an artistic master mind or the sensibility and skill of an artist, ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کامل